Partial Commutation and Traces
نویسنده
چکیده
منابع مشابه
On the Synchronization of Semi-Traces
The synchronization of two or more semi-traces describes the possible evaluation of a concurrent system, which consists of two or more concurrent subsystems in a modular way, where communication between the subsystems restricts the order of the actions. In this paper we give criteria, which tell us for given semi-traces in given semicommutation systems, whether they are synchronizable and wheth...
متن کاملRegular languages and partial commutations
The closure of a regular language under a [partial] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial] commutation still regular? (2) Are there any robust classes of languages closed under [partial] commutation? We show that the class Pol(G) of polynomials of group languages is closed un...
متن کاملClosure of regular languages under semi-commutations
The closure of a regular language under a [partial, semi-] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial, semi-] commutation still regular? (2) Are there any robust classes of languages closed under [partial, semi-] commutation? We show that the class Pol(G) of polynomials of group l...
متن کاملWhen Does Partial Commutative Closure Preserve Regularity?
The closure of a regular language under commutation or partial commutation has been extensively studied [1, 11, 12, 13], notably in connection with regular model checking [2, 3, 7] or in the study of Mazurkiewicz traces, one of the models of parallelism [14, 15, 16, 22]. We refer the reader to the survey [10, 9] or to the recent articles of Ochmański [17, 18, 19] for further references. In this...
متن کاملTraces of Control-Flow Graphs
This is a new applied development of trace theory to compilation. Trace theory allows to commute independent program instructions, but overlooks the differences between control and data dependencies. Control(C)-dependences, unlike data-dependences, are determined by the Control Flow Graph, modelled as a local DFA. To ensure semantic equivalence, partial commutation must preserve C-dependences. ...
متن کامل